搜索资源列表
Node
- Binary Expression Tree show in SVG
1
- 建立二叉树 中序遍历二叉树算法 计算二叉树的节点-Set up tree traversal in binary tree algorithm binary tree node
huffmanbianmayimaqi
- 构造每个字符的哈夫曼编码,选出树中两个权值最小的结点-Construction of the Huffman coding for each character, the right to elect two tree node the smallest value
pxtree
- 每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data
AVL-TREE
- 实现了AVL_tree的插入与删除功能 及AVL_tree的线索化，并心图形的方式打印出结果-Implement insert and remove of a node in a AVL-tree
xrun
- 数据结构之任意多叉树的建立和操作，包括先序，中序，层序，和插入节点，统计树信息。 融入了树，双向队列等经典数据结构的使用模式。-Data structure of any multi-branch tree establishment and operation, including the first order, in sequence, sequence, and insert the node, the tree statistics information. Into the tr
tongjierchashujiedian
- 这是一个统计二叉树结点的小程序，软件实验课上自己编的。-This is a binary tree node statistics applets, software for experimental class of its own.
SettingsDlg_demo
- 一个MFC框架中模式对话框和无模式对话框, 类似设置界面,点左边TREE的节点右面显示对应的输入界面和控件.-MFC framework of a model of dialog and non-model dialog box, set up a similar interface, point the left TREE node corresponding to the right shows the input interface and controls.
S020600424
- 最近公共祖先问题 问题描述：给定一棵树，设计一个算法对于给定的两个结点返回他们的最近公共祖先 实验任务：对于给定的树和树中的结点对，输出最近公共祖先-Recently, the issue of public issue of ancestral Descr iption: given a tree, to design an algorithm for a given node of the two return to their ancestors in recent experim
shuju7
- 灵活运用非递归的遍历算法实现二叉树的其它各种运算；掌握按层次顺序遍历二叉树的方法；熟练掌握在中序线索二叉树上找给定结点的指定顺序下的前驱和后继的方法。-Flexibility in the use of non-recursive binary tree traversal algorithm to achieve a variety of other operations master-level order according to the method of binary tree tr
5.6.1
- 1、二叉树的创建和遍历演示 1）从键盘输入二叉树的各结点值，按先序递归方式创建二叉树 2）分别实现先序、中序、后序递归遍历二叉树 3）输出二叉树的按层次遍历序列 4）输出二叉树的中序非递归遍历下的结点访问次序-1, binary tree traversal of the creation and demonstration of 1) from the keyboard input of the binary tree node value, according to firs
IntervalSearch
- 区间树上的重叠区间查找算法:通过增加树结点的信息域将红黑树扩张为区间树，并通过给定的某个区间i，查找区间树上相应的重叠区间。-The overlap interval between the tree search algorithm: tree node by increasing the information domain will be red and black tree expansion for the interval tree, and through a given inte
exp7-1
- 实现二叉树b的各种运算： 1. 输出二叉树； 2. 输出 H 结点的左·右孩子结点值； 3. 输出二叉树b的深度； 4. 输出二叉树b的宽度； 5. 输出二叉树b的结点个数； 6. 输出二叉树b的叶子结点个数。-Binary Tree b to achieve a variety of computing: 1. Output tree 2. Output the children of node H child nodes around node val
tree
- <1>将一棵树（或森林）转换为二叉树。 <2>求森林的高度。 <3>按层次方式遍历森林。 <4>输出一个森林中每个结点的值及其对应的层次数。 <5>输出一个森林的广义表形式，如下图中的森林的输出为：-< 1> will be a tree (or forest) into a binary tree. < 2> for the high forest. < 3> by way of tra
UNIXbaogao
- 在一个半径为R的监测区域，随机分布有M个节点，每个节点的感应半径为r，请完成： （1）建立节点的位置信息文件 （2）建立网络的拓扑信息文件 （3）输出最佳路由即最小生成树 -Radius of R in a monitoring region, a random distribution of M nodes, each node of the sensor radius r, please complete: (1) to establish the location of t
mTree
- 快速、小巧、功能强大的树 var tree=new Tree("根节点") var nodei=new TreeNode("节点1") tree.appendChild( nodei ) tree.expandAll() 支持checkbox 一个页面可以有多个树，代码干净 现在在公司的项目中广泛应用-Fast, compact and powerful tree var tree = new Tree ( " root" ) var
javascrip-tree
- 一个基于JAVAscr ipt下的树模型结构。支持节点超链接功能。-JAVAscr ipt under a tree-based model structure. Hyperlink function to support the node.
tree
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a search along the line, followed on each node in the tree are done once and only one visit. Access node operation done depends on the
Tree
- 由节点生成树，并对生成树的左右子树交换，求节点数及树的高度。-By the node spanning tree, spanning tree and the exchange of left and right subtree, and the number of nodes and tree height.
20071219
- N叉树的结点插入、删除、查找，以及显示 内含程序及代码，一个exe文件一个cpp文件-N-tree node insert, delete, find, and display procedures and code includes an exe file a cpp file